Dynamic Proportional Sharing

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Proportional Sharing: A Game-Theoretic Approach

Ensuring user entitlements in computing systems with scarce and commonly preferred resources requires time sharing. We allocate resources using a novel token mechanism that supports gametheoretic desiderata such as sharing incentives and strategy-proofness. Œe mechanism frames the allocation problem as a repeated game. In each round of the game, users report their demands for resources and spen...

متن کامل

Dynamic Partial Buffer Sharing scheme: Proportional Packet Loss Rate

In this paper, we propose a new packet loss control mechanism – Dynamic Partial Buffer Sharing scheme. With DPBS scheme, the thresholds are dynamically adjusted in run-time based on packet loss behavior. So that DPBS scheme avoids parameter-setting problem, and it can achieve desired relative packet loss ratio easily. In addition, DPBS scheme can achieve higher buffer utilization for its adapta...

متن کامل

Incentive Ratios of a Proportional Sharing Mechanism in Resource Sharing

In a resource sharing system, resources are shared among multiple interconnected peers. Peers act as both suppliers and customers of resources by making a certain amount of their resource directly available to others. In this paper we focus on a proportional sharing mechanism, which is fair, efficient and guarantees a market equilibrium in the resource sharing system. We study the incentives an...

متن کامل

Market-based Proportional Resource Sharing for Clusters

Enabling technologies in high speed communication and global process scheduling have pushed clusters of computers into the mainstream as general-purpose high-performance computing systems. More generality, however, implies more sharing and this raises new questions in the area of cluster resource management. In particular, in systems where the aggregate demand for computing resources can exceed...

متن کامل

Asymptotic Properties of Proportional-Fair Sharing Algorithms

We are concerned with the allocation of channel or transmitter resources for time varying mobile communications. There are many users who are competing to transmit data over the resource. Time is divided into small scheduling intervals, and information on the channel rates for the various users is available at the start of the intervals. Since the rates vary randomly, there is a conflict at any...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM SIGMETRICS Performance Evaluation Review

سال: 2019

ISSN: 0163-5999

DOI: 10.1145/3292040.3219631